Hypertableau and Path-Hypertableau Calculi for Some Families of Intermediate Logics
نویسندگان
چکیده
In this paper we investigate the tableau systems corresponding to hypersequent calculi. We call these systems hypertableau calculi. We define hypertableau calculi for some propositional intermediate logics. We then introduce path-hypertableau calculi which are simply defined by imposing additional structure on hypertableaux. Using pathhypertableaux we define analytic calculi for the intermediate logics Bdk, with k ≥ 1, which are semantically characterized by Kripke models of depth ≤ k. These calculi are obtained by adding one more structural rule to the path-hypertableau calculus for Intuitionistic Logic.
منابع مشابه
Tableau Calculi for the Logics of Finite k-Ary Trees
We present tableau calculi for the logics Dk (k ≥ 2) semantically characterized by the classes of Kripke models built on finite k-ary trees. Our tableau calculi use the signs T and F, some tableau rules for Intuitionistic Logic and two rules formulated in a hypertableau fashion. We prove the Soundness and Completeness Theorems for our calculi. Finally, we use them to prove the main properties o...
متن کاملA Hypertableau Calculus for SHIQ
We present a novel reasoning calculus for the Description Logic SHIQ. In order to reduce the nondeterminism due to general inclusion axioms, we base our calculus on hypertableau and hyperresolution calculi, which we extend with a blocking condition to ensure termination. To prevent the calculus from generating large models, we introduce “anywhere” pairwise blocking. Our preliminary implementati...
متن کاملHypertableau Reasoning for Description Logics
We present a novel reasoning calculus for the description logic SHOIQ—a knowledge representation formalism with applications in areas such as the Semantic Web. Unnecessary nondeterminism and the construction of large models are two primary sources of inefficiency in the tableau-based reasoning calculi used in state-of-the-art reasoners. In order to reduce nondeterminism, we base our calculus on...
متن کاملExtending Consequence-Based Reasoning to SRIQ
Consequence-based calculi are a family of reasoning algorithms for description logics (DLs), and they combine hypertableau and resolution in a way that often achieves excellent performance in practice. Up to now, however, they were proposed for either Horn DLs (which do not support disjunction), or for DLs without counting quantifiers. In this paper we present a novel consequence-based calculus...
متن کاملHermiT: A Highly-Efficient Reasoner for Description Logics
HermiT is a reasoner for the Description Logic SHOIQ +. The system is based on a novel “hypertableau” calculus and includes a number of new optimizations. HermiT demonstrates significantly faster performance when classifying large and complex ontologies than other state-of-the-art reasoners. HermiT is also the first reasoner able to classify a number of important knowledge bases, including the ...
متن کامل